Uniform confluence in concurrent computation
نویسندگان
چکیده
منابع مشابه
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the successful actor is indeterministic. As a consequence, the execution of a concurrent program may be nonconfluent. Even worse, most observables (termination, computational result, and time complexity) typically depend on t...
متن کاملUniform Confluence in Concurrent Computation (Unabridged)
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the successful actor is indeterministic. As a consequence, the execution of a concurrent program may be nonconfluent. Even worse, most observables (termination, computational result, and time complexity) typically depend on t...
متن کاملConfluence in Concurrent Constraint Programming
Concurrent constraint programming (ccp), like most of the concurrent paradigms, has a mechanism of global choice which makes computations dependent on the scheduling of processes. This is one of the main reasons why the formal semantics of ccp is more complicated than the one of its deterministic and local-choice sublanguages. In this paper we study various subsets of ccp obtained by adding som...
متن کاملTyping Non-uniform Concurrent Objects
Concurrent objects may offer services non-uniformly, constraining the acceptance of messages on the states of objects. We advocate a looser view of communication errors. Safe programmes must guarantee that every message has a chance of being received if it requests a method that may become enabled at some point in the future. We formalise non-uniform concurrent objects in TyCO, a name-passing o...
متن کاملConcurrent Self-Explaining Computation
Self-explaining computation is an approach to program execution in which every value comes with an explanation of how it was computed. The explanation can be used to reverse the computation and to slice the original program relative to any part of the output of interest. As a result, self-explaining computation is a suitable foundation for o ine dynamic program analyses such as taint analysis a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2000
ISSN: 0956-7968
DOI: 10.1017/s0956796800003762